/**
 * Created with IntelliJ IEDA.
 * Description:
 * User:86186
 * Date:2022-10-10
 * Time:22:43
 */

import java.util.Scanner;

/**
 * 牛牛定义排序子序列为一个数组中一段连续的子序列,并且这段子序列是非递增或者非递减排序的。
 * 牛牛有一个长度为n的整数数组A,他现在有一个任务是把数组A分为若干段排序子序列,牛牛想知道他最少可以把这个数组分为几段排序子序列.
 */

public class Main2 {
    static int a;
    public static void main(String[] args) {
//        Scanner sc = new Scanner(System.in);
//        int length = sc.nextInt();
//        int[] ary = new int[length + 1];//创建初始大小比实际元素个数多1
//        int index = 0;
//        while (sc.hasNext()) {
//            ary[index++] = sc.nextInt();
//        }
//        int res = minDivide(ary, length);
//        System.out.println(res);
        System.out.println(a);
        System.out.println(Math.round(11.5));
        System.out.println(Math.round(-11.5));
    }


    public static int minDivide(int[] ary, int length) {
        int count = 0;//记录区间个数
        int cur = 0;//用于遍历的下标
        if (length <= 2) {
            return 1;
        }
        for (; cur < length; cur++) {
            if (ary[cur + 1] == ary[cur]) {
                //情况一：ary[i]=ary[i+1]
                continue;
            } else if (ary[cur] < ary[cur + 1]) {
                //情况二：ary[i]<ary[i+1]
                while (cur < length && ary[cur] <= ary[cur + 1]) {
                    //while循环直到ary[cur]>ary[cur+1]
                    cur++;
                }
                count++;
            } else if (ary[cur] > ary[cur + 1]) {
                //情况三：ary[i]>ary[i+1]
                while (cur < length && ary[cur] >= ary[cur + 1]) {
                    //while循环直到ary[cur]<ary[cur+1]
                    cur++;
                }
                count++;
            }

        }
        return count;
    }
}
